Data gathering and personalized broadcasting in radio grids with interference
نویسندگان
چکیده
منابع مشابه
Data gathering and personalized broadcasting in radio grids with interference
In the gathering problem, a particular node in a graph, the base station, aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbors (such an action is called a call). However, a node cannot send and receive a message during the same step. Moreover, the communication is subjet to interference constraints, more precisely, two calls ...
متن کاملData Gathering and Personalized Broadcasting in Radio Grids with Interferences
In the gathering problem, a particular node in a graph, the base station, aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbor (such an action is called a call). However, a node cannot send and receive a message during the same step. Moreover, the communication is subjet to interference constraints, more precisely, two calls i...
متن کاملEfficient Gathering in Radio Grids with Interference†
We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most dT and there is no interference from other transmissions. One transmission interferes with the reception of another transmission if the sender of the first transmission is at distance dI or less from th...
متن کاملOptimal gathering in radio grids with interference
We study the problem of gathering information from the nodes of a radio network into a central node. We model the network of possible transmissions by a graph and consider a binary model of interference in which two transmissions interfere if the distance in the graph from the sender of one transmission to the receiver of the other is dI or less. A round is a set of compatible (i.e., non-interf...
متن کاملMinimum Delay Data Gathering in Radio Networks
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbors at most one data item. Each device is equipped with a half duplex interface; so a node cannot both ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.029